| 1. | The security of the algorithm is analyzed from the randomness , linear complexity of the chaotic sequence and the intensity of initial key . the results show the randomness of the key sequence pass the frequency test , sequential test , poker test , autocorrelation test , runs test , etc . and the total level is better than the binary sequence generated by the prng of delphi 7 . 0 , logistic chaotic system and rc4 , the linear complexity comes up to the expectation , the initial key has very strong intensity
本文最后从混沌序列的随机性、线性复杂度和初始密钥的强度三个方面对算法进行了安全性分析，结果表明算法产生的密钥序列的随机性完全通过了频数检验、序列检验、扑克检验、自相关检验和游程检验等5种统计检验方法的检验，而且整体水平要好于delphi7 . 0中的伪随机数发生器、 logistic混沌系统和rc4三种方法产生的二进制序列，线性复杂度达到了数学期望值。 |
